|
Riesel Sieve is a distributed computing project, running in part on the BOINC platform. Its aim is to prove that 509,203 is the smallest Riesel number, by finding a prime of the form for all odd smaller than 509,203. ==Progress of the project== At the start of the project in August 2003, there were less than 509,203 for which no prime was known. , 37 of these had been eliminated by Riesel Sieve or outside persons; the largest prime found by this project is 485,767 × 23,609,357 − 1 of 1,086,531 digits,〔(Riesel Sieve Project ) at The Prime Pages. Retrieved 2008-08-04.〕 and it is known that for none of the remaining there is a prime with ''n'' < 2,000,000. The project proceeds in the same way as other prime-hunting projects like GIMPS or Seventeen or Bust: sieving eliminates pairs (''k'', ''n'') with small factors, and then a deterministic test, in this case the Lucas-Lehmer-Riesel test based on the Lucas-Lehmer test, is used to check primality of numbers without small factors. Users can choose whether to sieve or to run LLR tests on candidates sieved by other users; heavily-optimised sieving software is available. Riesel Sieve maintains lists of the primes that have been found〔Riesel Sieve, (Project Prime Finder Hall of Fame ).〕 and the ''k'' whose status is still unknown.〔PrimeGrid, (Current k Status ).〕 From 2010 onward, the investigation has been taken over by another distributed computing project, PrimeGrid. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Riesel Sieve」の詳細全文を読む スポンサード リンク
|